Lintasan Hamiltonian pada Graf 4-Connected
نویسندگان
چکیده
Teori graf merupakan salah satu materi dalam ilmu Matematika yang digunakan bentuk representasi masalah secara deskripsi. Menurut beberapa penelitian,teori banyak untuk menganalisa topik berkaitan dengan transpotasi, rangkaian jaringan komputer atau telepon, dan hal lainnya. Tujuan penelitian ini , yaitu membuktikan bahwa penggunaan 4-connected graph dibentuk dari definisi telah didapatkan model tidak Uniquely Hamiltonian.. Penelitian dilakukan menggunakan sumber pustaka jurnal terpercaya. Dengan batasan sederhana, terhubung Hamilton. Dari hasil dapat diketahui G di ,yaitu lengkap memenuhi 4-connected. Sehingga disimpulkan sebagai 4-connected bukanlah Hamiltonian.
منابع مشابه
4-connected Projective-planar Graphs Are Hamiltonian-connected
We generalize the following two seminal results. 1. Thomassen’s result [19] in 1983, which says thatevery 4-connected planar graph is hamiltonian-connected (which generalizes the old result of Tutte[20] in 1956, which says that every 4-connectedplanar graph is hamiltonian). 2. Thomas and Yu’s result [16] in 1994, which saysthat every 4-connected projective planar graph is<lb...
متن کامل4-Connected Projective-Planar Graphs Are Hamiltonian
We prove the result stated in the title (conjectured by Grünbaum), and a conjecture of Plummer that every graph which can be obtained from a 4–connected planar graph by deleting two vertices is Hamiltonian. The proofs are constructive and give rise to polynomial–time algorithms.
متن کاملEvery 5-connected planar triangulation is 4-ordered Hamiltonian
A graph G is said to be 4-ordered if for any ordered set of four distinct vertices of G, there exists a cycle in G that contains all of the four vertices in the designated order. Furthermore, if we can find such a cycle as a Hamiltonian cycle, G is said to be 4-ordered Hamiltonian. It was shown that every 4-connected planar triangulation is (i) Hamiltonian (by Whitney) and (ii) 4-ordered (by Go...
متن کامل2-edge-Hamiltonian-connectedness of 4-connected plane graphs
A graph G is called 2-edge-Hamiltonian-connected if for any X ⊂ {x1x2 : x1, x2 ∈ V (G)} with 1 ≤ |X| ≤ 2, G ∪ X has a Hamiltonian cycle containing all edges in X, where G ∪ X is the graph obtained from G by adding all edges in X. In this paper, we show that every 4-connected plane graph is 2edge-Hamiltonian-connected. This result is best possible in many senses and an extension of several known...
متن کاملSome 3-connected 4-edge-critical non-Hamiltonian graphs
Let (G) be the domination number of graph G, thus a graph G is k -edge-critical if (G) 1⁄4 k ; and for every nonadjacent pair of vertices u and v, (Gþ uv) 1⁄4 k 1. In Chapter 16 of the book ‘‘Domination in Graphs— Advanced Topics,’’ D. Sumner cites a conjecture of E. Wojcicka under the form ‘‘3-connected 4-critical graphs are Hamiltonian and perhaps, in general (i.e., for any k 4), (k 1)-connec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: d'Cartesian: Jurnal Matematika dan Aplikasi
سال: 2021
ISSN: ['2302-4224', '2685-1083']
DOI: https://doi.org/10.35799/dc.9.2.2020.29735